Distributed Algorithms for Optimal Rate Allocation of Multipath Traffic Flows

We address the question of optimal rate allocation for multipath unicast traffic, with theobjective of maximizing the total system utility. First, we consider the problem where the setof paths (routes) between each flow is predetermined, and show how the optimal rates on thesepaths can be computed. We then consider the problem where the paths are not predetermined,and present an approach that finds the optimal paths as well as the optimal rates on thesepaths. For both the problems, the algorithms that we develop are completely decentralized,computationally simple, and have a low communication overhead. We demonstrate, throughanalysis and simulation, that our algorithms converge and attain the maximum system utility.